On Laslett’s Transform for the Boolean Model

نویسنده

  • A. D. Barbour
چکیده

Consider the Boolean model in IR, where the germs form a homogeneous Poisson point process with intensity λ and the grains are convex compact random sets. It is known (see e.g. Section 9.5.3 in Cressie (1993)) that Laslett’s rule transforms the exposed tangent points of the Boolean model into a homogeneous Poisson process with the same intensity λ. In the present paper, we give a simple proof of this result, which is based on a martingale argument. We also consider the cumulative process of uncovered area in a vertical strip and show that a (linear) Poisson process with intensity λ can be embedded in it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Delineation of Groundwater Recharge Sites Using GIS Case Study: Sefied Dasht

The water crisis is harmful effects on human life. Also one of the most problems in the human society is water resources management. In this study, site selection of most suitable areas for artificial recharge using Boolean model. Criteria used to select the most suitable area for artificial recharge included: infiltration, slope, aquifer thickness, aquifer quality.  The layers were produced an...

متن کامل

Delineation of Groundwater Recharge Sites Using GIS Case Study: Sefied Dasht

The water crisis is harmful effects on human life. Also one of the most problems in the human society is water resources management. In this study, site selection of most suitable areas for artificial recharge using Boolean model. Criteria used to select the most suitable area for artificial recharge included: infiltration, slope, aquifer thickness, aquifer quality.  The layers were produced an...

متن کامل

Propagation Models and Fitting Them for the Boolean Random Sets

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

متن کامل

Optimal Positioning of Middle Schools within the City of Dehdasht through a Combination of Boolean Logic and FAHP

Optimal Positioning of Middle Schools within the City of Dehdasht through a Combination of Boolean Logic and FAHP M.A. Firoozi, Ph.D. P. Rahmaani N. Hosseini Shahpariyaan M. Fereydoonnejaad Optimal positioning of schools is of much interest to planners because the rapid increase in population and structural changes within the cities could lead to distribution problems if not fo...

متن کامل

Computational complexity lower bounds of certain discrete Radon transform approximations

For the computational model where only additions are allowed, the Ω(n log n) lower bound on operations count with respect to image size n × n is obtained for two types of the discrete Radon transform implementations: the fast Hough transform and a generic strip pattern class which includes the classical Hough transform, implying the fast Hough transform algorithm asymptotic optimality. The proo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002